LeetCode Solutions

Appearance

3259. 超级饮料的最大强化能量 ​

为保证权益，题目请参考 3259. 超级饮料的最大强化能量(From LeetCode).

解决方案1 ​

Python ​

python
"""
动态规划
"""

from typing import List


class Solution:
    def maxEnergyBoost(self, energyDrinkA: List[int], energyDrinkB: List[int]) -> int:
        n = len(energyDrinkA)
        if n == 1:
            return max(energyDrinkA[0], energyDrinkB[0])

        if n == 2:
            return max(sum(energyDrinkA), sum(energyDrinkB))

        dp = [[0, 0] for _ in range(n)]
        dp[0][0] = energyDrinkA[0]
        dp[0][1] = energyDrinkB[0]
        dp[1][0] = energyDrinkA[0] + energyDrinkA[1]
        dp[1][1] = energyDrinkB[0] + energyDrinkB[1]
        for i in range(2, n):
            dp[i][0] = max(dp[i - 1][0], dp[i - 2][1]) + energyDrinkA[i]
            dp[i][1] = max(dp[i - 1][1], dp[i - 2][0]) + energyDrinkB[i]

        return max(dp[n - 1])